A note on minimum linear arrangement for BC graphs
نویسندگان
چکیده
منابع مشابه
A note on minimum linear arrangement for BC graphs
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, Z-cubes, etc. as the subfamilies.
متن کاملMinimum Linear Arrangement of Series-Parallel Graphs
We present a factor 14D approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where D is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time O(|E|) and is very easy to implement. Its divide-andconquer approach allows for an effective parallelization. Note that a suitable decomposition can also be comput...
متن کاملThe minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 Preliminaries Let F be a family of nonempty sets. The intersection graph of F is obtained by representing each set in F by a vertex and connecting two vertices by an edge if and only if their corresponding sets interse...
متن کاملDecorous Lower Bounds for Minimum Linear Arrangement
Alberto Caprara DEIS, Università di Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy, [email protected] Adam N. Letchford Department of Management Science, Lancaster University, Lancaster LA1 4YX, Great Britain, [email protected] Juan-José Salazar-González DEIOC, Universidad de La Laguna, c/ Astrof́ısico Francisco Sánchez, s/n E-38271 La Laguna, Tenerife, Spain, jjsalaza@...
متن کاملThe planar minimum linear arrangement problem is different from the minimum linear arrangement problem
In various research papers, such as [2], one will find the claim that the minLA is optimally solvable on outerplanar graphs, with a reference to [1]. However, the problem solved in that publication, which we refer to as the planar minLA, is different from the minLA, as we show in this article. In constrast to the minimum linear arrangement problem (minLA), the planar minimum linear arrangement ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics, Algorithms and Applications
سال: 2018
ISSN: 1793-8309,1793-8317
DOI: 10.1142/s1793830918500234